primal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
نویسندگان
چکیده
this paper proposes a family of robust counterpart for uncertain linear programs (lp) which is obtained for a general definition of the uncertainty region. the relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. those properties lead us to characterize primal and dual robust counterparts. the researchers show that when the uncertainty region is small the corresponding robust counterpart is less conservative than the one for a larger region. therefore, the model can be adjusted by choosing an appropriate norm body and the radius of the uncertainty region. we show how to apply a robust modeling approach to single and multi-period portfolio selection problems and illustrate the model properties with numerical examples.
منابع مشابه
Primal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملUncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
In this paper, we introduce the extended affinely adjustable robust counterpart to modeling and solving multistage uncertain linear programs with fixed recourse. Our approach first reparameterizes the primitive uncertainties and then applies the affinely adjustable robust counterpart proposed in the literature, in which recourse decisions are restricted to be linear in terms of the primitive un...
متن کاملAn Augmented Primal-Dual Method for Linear Conic Programs
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimization of a convex differentiable function. This “agumented primal-dual function” or “apd-function” is restricted to an affine set in the primal-dual space. The evaluation of the function and its derivative is cheap if the...
متن کاملABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملRobust CVaR Approach to Portfolio Selection with Uncertain Exit Time
In this paper we explore the portfolio selection problem involving an uncertain time of eventual exit. To deal with this uncertainty, the worst-case CVaR methodology is adopted in the case where no or only partial information on the exit time is available, and the corresponding problems are integrated into linear programs which can be efficiently solved. Moreover, we present a method for specif...
متن کاملRobust solutions of uncertain linear programs
We treat in this paper Linear Programming (LP) problems with uncertain data. The focus is on uncertainty associated with hard constraints: those which must be satisfied, whatever is the actual realization of the data (within a prescribed uncertainty set). We suggest a modeling methodology whereas an uncertain LP is replaced by its Robust Counterpart (RC). We then develop the analytical and comp...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of industrial engineering, internationalISSN 1735-5702
دوره 2
شماره 2 2006
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023